AND/OR graph
英
美
网络 与或图
双语例句
- Connector in AND/ OR graph
与／或图中的连接符 - Unlike other databases which store their data in rows, columns or key-value pairs a graph database stores all information in a network of nodes and edges.
和其他以列、行或者键/值等形式存储数据的数据库不同，图形数据库以节点（Node）和边（Edge）的网络存储所有信息。 - According to the characteristics of the ICAI knowledge, the concept of knowledge structure AND/ OR graph is presented by researching the two main relationships among knowledge points.
根据ICAI中知识的特点，通过分析知识点之间的关系，本文提出了知识结构与或图的知识表示框架，并引入知识组件来降低结构的复杂度并对其进行形式化研究。 - Heuristic function for AND/ OR graph
与或图的启发式函数 - Several sieves are applied during the course of modeling of disassembly AND/ OR graph, and the estimate of sieving rate is the precondition of reasonable sieving sequence.
拆卸与或图是拆卸模型中的一种，它的建模过程需要利用多重筛子进行筛选，筛选率的估计是合理安排筛选顺序的前提。 - It also introduces and/ or attack tree into the attack scenario, cut down the system requirement of space, and provides support for both the coming graph rewriting model and decision selection algorithm.
引入了与或攻击树构建攻击场景，节约了运行所需的空间，为后来的决策选择打下基础，同时也为以后的图重写的风险分析提供依据。 - DfD ( design for disassembly) is a key part of environmentally conscious manufacturing for electr ( on) ic products, and DAOG ( disassembly AND/ OR graph) is a kind of graph models used for disassembly process planning in DfD.
面向拆卸的设计是机电产品绿色制造系统中的重要组成部分，拆卸与或图是进行面向拆卸的设计时开展拆卸过程规划所需的一种模型。 - And/ or graph heuristic search algorithm Nao based on norm s
模S下的AND/OR图的启发式搜索算法NAO - Research on assembly sequences generation algorithm using and/ or graph
装配顺序的与或图生成算法研究 - A new type of general AND/ OR graph is defined on triangle norm.
本文首先根据三角模概念，定义了一类新的更具普遍意义的广义AND/OR图。 - A Research on Admissibility of AND/ OR Graph Algorithm NAO Based on Norm S
模S下的AND/OR图NAO算法的可采纳性研究 - A New Algorithm for AND/ OR Graph Solution
一个新的与或图求解算法 - An example demonstrates that sieved disassembly AND/ OR graph guarantees the perfection of model and suits the disassembly-recycling planning of product.
实例分析表明，筛选后的拆卸与或图既能保证图模型的完备性，又在规模上适于进行后续的拆卸回收规划。 - Improvement of connectivity sieve algorithms for disassembly AND/ OR graph
对拆卸与或图连通性判定算法的改进和研究 - The AND/ OR graph search algorithms are discussed. We analyze their complexity, and emphasize their advantages and shortcomings as well. Some improved points are put forward.
讨论了图搜索的AND／OR图算法，着重分析了它们的复杂性、优缺点及其相互关系，提出了改进要点.此外，探讨了类比搜索方法。 - Then, the nodes were merged by some rules and Disassembly AND/ OR Graph was pretreated so that the disposing data of Graph were reduced greatly.
然后以一定准则合并节点，对拆卸与或图进行预处理，使拆卸与或图的处理数据大大减少。 - The control reduction AND/ OR graph established by the paper, essentially, gives an example offormal approach to designing expert controller.
文中所提出的控制归约与或图，实际上为设计专家控制器示范了一种形式化的方法。 - Through computing the AND/ OR Graph structure partly, the data disposal is optimized.
通过对部分与或图图结构的计算，验证了该方法对数据处理的优化效果。 - Because there existed high time complexity in AND/ OR graph search algorithms, it had to reduce the size of problem searching space to improve the practicability of the method.
由于与或图搜索算法具有很高的时间复杂度，因此必须降低问题搜索空间的规模，以提高方法的实用性。 - Therefore, this thesis uses an AND/ OR graph to present the composed services paths, which can express data flow relationships more clearly in the process of service composition and can solve the problems of multi-service and multi-input.
为此，本文提出了采用与或图来表示组合路径的方法，该方法不但能解决多输入和多服务表示问题，还能更清晰地表示出服务组合过程中的数据流之间的关系。